1,034 research outputs found
Ceramides: a new player in the inflammation-insulin resistance paradigm?
No abstract available
A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks
This paper presents a novel spectral algorithm with additive clustering
designed to identify overlapping communities in networks. The algorithm is
based on geometric properties of the spectrum of the expected adjacency matrix
in a random graph model that we call stochastic blockmodel with overlap (SBMO).
An adaptive version of the algorithm, that does not require the knowledge of
the number of hidden communities, is proved to be consistent under the SBMO
when the degrees in the graph are (slightly more than) logarithmic. The
algorithm is shown to perform well on simulated data and on real-world graphs
with known overlapping communities.Comment: Journal of Theoretical Computer Science (TCS), Elsevier, A Para\^itr
Author finding post print - The Multiple Sclerosis-Fatigue Self- Efficacy (MS-FSE) scale: initial validation.
To examine the validity and sensitivity to change of the Multiple Sclerosis-Fatigue Self-Efficacy scale
Corrected overlap weight and clustering coefficient
We discuss two well known network measures: the overlap weight of an edge and
the clustering coefficient of a node. For both of them it turns out that they
are not very useful for data analytic task to identify important elements
(nodes or links) of a given network. The reason for this is that they attain
their largest values on maximal subgraphs of relatively small size that are
more probable to appear in a network than that of larger size. We show how the
definitions of these measures can be corrected in such a way that they give the
expected results. We illustrate the proposed corrected measures by applying
them on the US Airports network using the program Pajek.Comment: The paper is a detailed and extended version of the talk presented at
the CMStatistics (ERCIM) 2015 Conferenc
Effects of Contact Network Models on Stochastic Epidemic Simulations
The importance of modeling the spread of epidemics through a population has
led to the development of mathematical models for infectious disease
propagation. A number of empirical studies have collected and analyzed data on
contacts between individuals using a variety of sensors. Typically one uses
such data to fit a probabilistic model of network contacts over which a disease
may propagate. In this paper, we investigate the effects of different contact
network models with varying levels of complexity on the outcomes of simulated
epidemics using a stochastic Susceptible-Infectious-Recovered (SIR) model. We
evaluate these network models on six datasets of contacts between people in a
variety of settings. Our results demonstrate that the choice of network model
can have a significant effect on how closely the outcomes of an epidemic
simulation on a simulated network match the outcomes on the actual network
constructed from the sensor data. In particular, preserving degrees of nodes
appears to be much more important than preserving cluster structure for
accurate epidemic simulations.Comment: To appear at International Conference on Social Informatics (SocInfo)
201
The diplomat's dilemma: Maximal power for minimal effort in social networks
Closeness is a global measure of centrality in networks, and a proxy for how
influential actors are in social networks. In most network models, and many
empirical networks, closeness is strongly correlated with degree. However, in
social networks there is a cost of maintaining social ties. This leads to a
situation (that can occur in the professional social networks of executives,
lobbyists, diplomats and so on) where agents have the conflicting objectives of
aiming for centrality while simultaneously keeping the degree low. We
investigate this situation in an adaptive network-evolution model where agents
optimize their positions in the network following individual strategies, and
using only local information. The strategies are also optimized, based on the
success of the agent and its neighbors. We measure and describe the time
evolution of the network and the agents' strategies.Comment: Submitted to Adaptive Networks: Theory, Models and Applications, to
be published from Springe
The interplay of microscopic and mesoscopic structure in complex networks
Not all nodes in a network are created equal. Differences and similarities
exist at both individual node and group levels. Disentangling single node from
group properties is crucial for network modeling and structural inference.
Based on unbiased generative probabilistic exponential random graph models and
employing distributive message passing techniques, we present an efficient
algorithm that allows one to separate the contributions of individual nodes and
groups of nodes to the network structure. This leads to improved detection
accuracy of latent class structure in real world data sets compared to models
that focus on group structure alone. Furthermore, the inclusion of hitherto
neglected group specific effects in models used to assess the statistical
significance of small subgraph (motif) distributions in networks may be
sufficient to explain most of the observed statistics. We show the predictive
power of such generative models in forecasting putative gene-disease
associations in the Online Mendelian Inheritance in Man (OMIM) database. The
approach is suitable for both directed and undirected uni-partite as well as
for bipartite networks
Temporal perception deficits in schizophrenia: integration is the problem, not deployment of attentions
Patients with schizophrenia are known to have impairments in sensory processing. In order
to understand the specific temporal perception deficits of schizophrenia, we investigated and determined to what extent impairments in temporal integration can be dissociated from attention deployment using Attentional Blink (AB). Our findings showed that there was no evident deficit in the deployment of attention in patients with schizophrenia. However, patients showed an increased temporal integration deficit within a hundred-millisecond timescale. The degree of such integration dysfunction was correlated with the clinical manifestations of schizophrenia. There was no difference between individuals with/without schizotypal personality disorder in temporal integration. Differently from previous studies using the AB, we did not find a significant impairment in deployment of attention in schizophrenia. Instead, we used both theoretical and empirical approaches to show
that previous findings (using the suppression ratio to correct for the baseline difference) produced a systematic exaggeration of the attention deficits. Instead, we modulated the perceptual difficulty of the task to bring the baseline levels of target detection between the groups into closer alignment. We found that the integration dysfunction rather than deployment of attention is clinically relevant, and thus should be an additional focus of research in schizophrenia
- …